Pascal and Francis Bibliographic Databases

Help

Search results

Your search

ti.\*:("Cologne\/Twente Workshop on Graphs and Combinatorial Optimization. CTW 2005")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 13 of 13

  • Page / 1
Export

Selection :

  • and

Cologne/Twente Workshop on Graphs and Combinatorial Optimization. CTW 2005FAIGLE, U; RANDERATH, B; SCHRADER, R et al.Discrete applied mathematics. 2008, Vol 156, Num 17, issn 0166-218X, 187 p.Conference Proceedings

An efficient algorithm for the three-guard problemXUEHOU TAN.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3312-3324, issn 0166-218X, 13 p.Conference Paper

Preemptive scheduling and antichain polyhedraQUILLIOT, Alain.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3267-3275, issn 0166-218X, 9 p.Conference Paper

Approximation algorithms for group prize-collecting and location-routing problemsGLICKSMAN, Hagai; PENN, Michal.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3238-3247, issn 0166-218X, 10 p.Conference Paper

Efficiency in exponential time for domination-type problemsSCHIERMEYER, Ingo.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3291-3297, issn 0166-218X, 7 p.Conference Paper

Equivalences and the complete hierarchy of intersection graphs of paths in a treeGOLUMBIC, Martin Charles; LIPSHTEYN, Marina; STERN, Michal et al.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3203-3215, issn 0166-218X, 13 p.Conference Paper

The stack loading and unloading problemMALUCELLI, Federico; PALLOTTINO, Stefano; PRETOLANI, Daniele et al.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3248-3266, issn 0166-218X, 19 p.Conference Paper

Topological sweep of the complete graphRAFALIN, Eynat; SOUVAINE, Diane L.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3276-3290, issn 0166-218X, 15 p.Conference Paper

Counting preimages of TCP reordering patternsHANSSON, Anders; ISTRATE, Gabriel.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3187-3193, issn 0166-218X, 7 p.Conference Paper

Parameterized algorithmics for linear arrangement problemsFERNAU, Henning.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3166-3177, issn 0166-218X, 12 p.Conference Paper

Semi-preemptive routing on treesKRUMKE, Sven O; RÄBIGER, Dirk; SCHRADER, Rainer et al.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3298-3304, issn 0166-218X, 7 p.Conference Paper

Discrete approximations to real-valued leaf sequencing problems in radiation therapyGUNAWARDENA, Athula; MEYER, Robert R.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3178-3186, issn 0166-218X, 9 p.Conference Paper

A clique-difference encoding scheme for labelled k-path graphsPEREIRA, P. R. C; MARKENZON, L; VERNET, O et al.Discrete applied mathematics. 2008, Vol 156, Num 17, pp 3216-3222, issn 0166-218X, 7 p.Conference Paper

  • Page / 1